Dexter Kozen: An Appreciation
نویسنده
چکیده
I have known Dexter for 30 years, which, of course, means that I was 9 when I first met him. At that time, Dexter was already “the man”. Although he was only a few years ahead of me, he had already made his name by independently defining the notion of alternating Turing machines, a deep contribution to complexity theory that made it possible to connect time and space complexity. The results were viewed as so significant that it was already being taught in a graduate course on complexity theory that I attended. Of even more interest to me at the time was Dexter’s work on modal logic, since a large part of my thesis was on dynamic logic. Finding a sound and complete axiomatization for dynamic logic had been an open problem for many years. Krister Segerberg had suggested an obviously sound axiomatization, but couldn’t prove it complete. Rohit Parikh [7] showed that it was indeed complete, but his proof was rather complicated. Dexter then came up with a much simpler proof, one that got at the essence of Rohit’s ideas; this version was published as [6]. The proof is truly beautiful. I have taught it often, and used the ideas in a number of subsequent papers (e.g., [3, 4]). This was my first introduction to Dexter’s ability to see into the heart of a problem. Perhaps the best-known example is Dexter’s work on the μ-calculus. Vaughan Pratt [8] had earlier suggested a logic with fixed-point operators. Dexter’s version [5] was more elegant, and is the one that everyone focuses on these days. I also soon learned about Dexter’s breadth. Besides complexity theory and modal logic, he also produced major results on algebra, such as the complexity of the theory of real closed algebraic theories [1]. I remember visiting IBM Yorktown Heights in the mid 1980s; Dexter was working there at the time. I mentioned to him some graph-theoretic problems I was working on. The rest of the day, I could see Dexter scratching away at a notepad, thinking about the problems. (He is still scratching away at notepads, although the notepad and the problems occupying him are no doubt different.) When I moved to Cornell in 1996, I saw a different side of Dexter. Dexter is a true department stalwart. He is well known to be a tremendous teacher. He can also always be counted on to play hockey or play music at a department function. (On top of everything else, Dexter is a terrific musician—I am
منابع مشابه
Competitive Online Algorithms At the end of August
In mid August Dexter Kozen, Joseph Newton Pew, Professor of Computer Science, Cornell University, Ithaca, NY, USA, will give a short course of six lectures on Set Constraints. Set constraints are inclusions between expressions denoting sets of ground terms. They have been used extensively in program analysis and type inference. The course will give an introduction to the theory and applications...
متن کاملBrzozowski's Algorithm (Co)Algebraically
We give a new presentation of Brzozowski’s algorithm to minimize finite automata, using elementary facts from universal algebra and coalgebra, and building on earlier work by Arbib and Manes on the duality between reachability and observability. This leads to a simple proof of its correctness and opens the door to further generalizations. This paper is dedicated to Dexter Kozen on the occasion ...
متن کاملSet Constraints In mid August
In mid August Dexter Kozen, Joseph Newton Pew, Professor of Computer Science, Cornell University, Ithaca, NY, USA, will give a short course of six lectures on Set Constraints. Set constraints are inclusions between expressions denoting sets of ground terms. They have been used extensively in program analysis and type inference. The course will give an introduction to the theory and applications...
متن کاملCompleteness of Kozen's Axiomatization for the Modal mu-Calculus: A Simple Proof
The modal μ-calculus, introduced by Dexter Kozen, is an extension of modal logic with fixpoint operators. Its axiomatization, Koz, was introduced at the same time and is an extension of the minimal modal logic K with the so-called Park fixpoint induction principle. It took more than a decade for the completeness of Koz to be proven, finally achieved by Igor Walukiewicz. However, his proof is fa...
متن کامل